Wardrop Equilibria with Risk-Averse Users

نویسندگان

  • Fernando Ordóñez
  • Nicolás E. Stier Moses
چکیده

N games can be used to model competitive situations in which agents select routes to minimize their cost. Common applications include traffic, telecommunication, and distribution networks. Although traditional network models have assumed that realized costs only depend on congestion, in most applications they also have an uncertain component. We extend the traffic assignment problem first proposed by Wardrop in 1952 by adding random deviations, which are independent of the flow, to the cost functions that model congestion in each arc. We map these uncertainties into a Wardrop equilibrium model with nonadditive path costs. The cost on a path is given by the sum of the congestion on its arcs plus a constant safety margin that represents the agents’ risk aversion. First, we prove that an equilibrium for this game always exists and is essentially unique. Then, we introduce three specific equilibrium models that fall within this framework: the percentile equilibrium where agents select paths that minimize a specified percentile of the uncertain cost; the added-variability equilibrium where agents add a multiple of the variability of the cost of each arc to the expected cost; and the robust equilibrium where agents select paths by solving a robust optimization problem that imposes a limit on the number of arcs that can deviate from the mean. The percentile equilibrium is difficult to compute because minimizing a percentile among all paths is computationally hard. Instead, the added-variability and robust Wardrop equilibria can be computed efficiently in practice: The former reduces to a standard Wardrop equilibrium problem and the latter is found using a column generation approach that repeatedly solves robust shortest path problems, which are polynomially solvable. Through computational experiments of some random and some realistic instances, we explore the benefits and trade-offs of the proposed solution concepts. We show that when agents are risk averse, both the robust and added-variability equilibria better approximate percentile equilibria than the classic Wardrop equilibrium.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equilibria for Networks with Malicious Users

We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behaviour. While selfish users follow a strategy that minimizes their individual cost, a malicious user will use his flow through the network in an effort to cause the maximum possible damage to this cost. We define a general...

متن کامل

Cooperative dynamics and Wardrop equilibria

A simple dynamics capturing user behavior in a network is shown to lead to equilibria that can be viewed as approximate, generalized Wardrop equilibria.

متن کامل

Pii: S0166-5316(02)00112-8

The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding to the case of a finite number of agents (such as service providers) that take routing decisions, and the Wardrop equilibrium, in which routing decisions are taken by a very large number of individual users. We show t...

متن کامل

Aspects of Wardrop equilibria

Global communication networks like the Internet often lack a central authority that monitors and regulates network traffic. Mostly even cooperation among network users is not possible. Network users may behave selfishly according to their private interest without regard to the overall system performance. Such highly complex environments prompted a paradigm shift in computer science. Whereas tra...

متن کامل

Dynamic Cesaro-Wardrop equilibration in networks

We analyze a routing scheme for a broad class of networks which converges (in the Cesaro sense) with probability one to the set of approximate Cesaro–Wardrop equilibria, an extension of the notion of a Wardrop equilibrium. The network model allows for wireline networks where delays are caused by flows on links, as well as wireless networks, a primary motivation for us, where delays are caused b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Transportation Science

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2010